2 Preliminary Lemmas
نویسنده
چکیده
We improve earlier work on the title equation (where p and q are primes and c is a positive integer) by allowing x and y to be zero as well as positive. Earlier work on the title equation showed that, with listed exceptions, there are at most two solutions in positive integers x and y, using elementary methods. Here we show that, with listed exceptions, there are at most two solutions in nonnegative integers x and y, but the proofs are dependent on nonelementary work of Mignotte, Bennett, Luca, and Szalay.
منابع مشابه
Supplement to “ Complementarity and aggregate implications of assortative matching : A nonparametric analysis ”
In this appendix, we state a number of preliminary results that will be used in the proofs of the four theorems in the main text. Detailed proofs of the results listed below may be found in Appendix C below. The proofs of the main results are given in Appendix B. The proof of Theorem 4.1 uses Lemmas A.1 and A.2 below. Theorems 5.1 and 5.2 use Lemmas A.3–A.12, A.14, A.15, Theorem A.2, and Lemmas...
متن کاملAutomatic Generation of Simple Lemmas from Recursive Definitions Using Decision Procedures - Preliminary Report
Using recent results on integrating induction schemes into decidable theories, a method for generating lemmas useful for reasoning about T -based function definitions is proposed. The method relies on terms in a decidable theory admitting a (finite set of) canonical form scheme(s) and ability to solve parametric equations relating two canonical form schemes with parameters. Using nontrivial exa...
متن کاملPeriod three actions on lens spaces
5 Disjoint bigons for non-triple point moves. 13 5.1 Definitions and preliminary combinatorics. . . . . . . . . . . . . . . . . . . . . . . . . 15 5.2 Intersection lemmas. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 5.3 There are at least three bigons. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 5.4 Disjoint bigons for saddle moves. . . . . . . ...
متن کاملBuilding Lemmas Using Examples
We present a heuristic for automated lemma discovery that generates lemmas that might help ACL2 in proving theorems like ∀x : t1(x) = t2(x). This heuristic exploits manually created examples of x. These examples are used to produce ground terms t′1 and t ′ 2, for which semantical models are built. In order to generate useful intermediate lemmas, we search for a specific pattern in these two mod...
متن کاملMaterial to “ Online Clustering of Bandits ”
This supplementary material contains all proofs and technical details omitted from the main text, along with ancillary comments, discussion about related work, and extra experimental results. 1. Proof of Theorem 1 The following sequence of lemmas are of preliminary importance. The first one needs extra variance conditions on the process X generating the context vectors. We find it convenient to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014